SUPER-SYMMETRIC DECOMPOSITION of the FOURTH-ORDER CUMULANT TENSOR. BLIND IDENTIFICATION of MORE SOURCES THAN SENSORS
نویسنده
چکیده
New ideas for Higher-Order Array Processing are introduced. The paper focuses on fourth-order cumulant statistics. They are expressed in an index-free formalism (that is believed to be of general interest) allowing the exploitation of all their symmetry properties. We show that, when dealing with 4-index quantities, symmetries are related to rank properties. The rich symmetry structure yields a whole class of new identification algorithms. Main features are : • Use of fourth-order cumulant statistics only : yielding asymptotically unbiased estimates in presence of Gaussian noise regardless of its spatial structure. • Blind Identification : directional vectors are estimated without a priori knowledge of the array manifold. • More source than sensors can be identified. The paper is mainly theoretical but, as a first application, a new algebraic technique for blind identification is included and a few others are briefly indicated. INTRODUCTION This paper deals with narrow-band array processing using higer-order statistics. We consider the problem of identifying directional vectors without knowing the array manifold (blind identification) by resorting only to 4th-order cumulant statistics. Various cumulant based methods for blind identification have recently been reported [1-3]. They all exploit both secondand fourth-order information. In contrast, this paper considers the Fourth-Order Only Blind Identification (FOOBI) problem. Restriction to 4th-order offers two advantages. Firstly, while 2nd-order cumulants are affected by additive Gaussian noise, 4th-order cumulants are not, so that no assumption about noise spatial structure is necessary. Secondly, more sources than sensors can be identified. Reported techniques [1-3] assume at most as many sources as sensors since they rely (explicitely or not) on a prior directional vector orthogonalization based on 2nd-order information. In contrast, FOOBI approaches can identify more sources than sensors by turning the orthogonality constraint into a less stringent symmetry constraint. It is important to take into account the symmetric structure of cumulants. In [3], two hermitian-like symmetries of 4thorder statistics were used. By taking into account an additional symmetry, the whole group of symmetries satisfied by 4thorder statistics of complex variables can be generated. This is why it is sufficient to consider a third symmetry, because it is, in some sense, the "last" symmetry. The paper is organized as follows. The 4th-order identification equation is established for independent sources in Gaussian noise. An index-free formalism is then introduced to handle 4th-order quantities and deal with all their symmetries. Symmetries are then shown to be related to rank properties. We give an exemple of a FOOBI algorithm and allude to other possible algorithms. FOURTH-ORDER ONLY BLIND IDENTIFICATION The standard linear model for a N-sensor array listening to S narrow-band point sources is most commonly written as : (1) X(t) = A α(t) + N (t) where X (t) and N (t) are N× 1 complex vectors representing measurements and additive noise. The source signals are stacked up in the S× 1 complex vector α(t) and the S columns of A are the N× 1 directional vectors. In the following, we use a slightly different notation for eq. (1) : we drop explicit dependence on t, we denote by αp the p-th element of vector α(t) and by P the p-th column of matrix A (hence P appears as a "self-indexed" symbol) so that (1) is rewritten as :
منابع مشابه
Higher-order Narrow-band Array Processing
This communication deals with narrow-band array processing using higher-order cumulants. A versatile tensor formalism is presented and adopted throughout to handle higher-order statistics of complex multivariates. We essentially focus on the use 4th-order cumulants for source localization in the spirit of the modern "subspace" techniques. We discuss "full cumulant tensor" solutions and their "d...
متن کاملBlind Identification of Underdetermined Mixtures Based on Charrelation Matrix
In this paper, we propose a novel algorithm for underdetermined blind identification problems in blind signal separation. The proposed algorithm is based on the charrelation matrix of observations. The charrelation matrix can not only be considered as a generalized covariance matrix, but also incorporates higher-order information. It is significant for blind separation problem based on statisti...
متن کاملA Tetradic Decomposition of 4 Th - Order Tensors . Application to the Source Separation Problem
Two results are presented on a SVD-like decomposition of 4th-order tensors. This is motivated by an array processing problem: consider an array of m sensors listening at n independent narrow band sources; the 4th-order cumulants of the array output form a 4th-order rank-deecient symmetric tensor which has a tetradic structure. Finding a tetradic decomposition of this tensor is equivalent to ide...
متن کاملBlind identification and source separation in 2×3 under-determined mixtures
Under-determined mixtures are characterized by the fact that they have more inputs than outputs, or, with the antenna array processing terminology, more sources than sensors. The problem addressed is that of identifying and inverting the mixture, which obviously does not admit a linear inverse. Identification is carried out with the help of tensor canonical decompositions. On the other hand, th...
متن کاملEigen-structure of the Fourth-order Cumulant Tensor with Application to the Blind Source Separation Problem
This communication deals with higher-order multivariate statistics. A first theoretical part is followed by an original application. In the first part we propose a special (index-free) tensor formalism to express fourth-order multivariate statistics. A quadricovariance "tensor" is defined which contains the 4th-order joint cumulants. In our formalism, the quadricovariance tensor and its "eigen-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991